BDS : A BDD - Based Logic Optimization System
نویسندگان
چکیده
This paper describes a novel logic decomposition theory and a practical logic synthesis system, BDS. It is based on a new binary decision diagrams (BDD) decomposition technique which supports all types of decomposition structures, including AND, OR, XOR, and complex MUX, both algebraic and Boolean. As a result, the method is very efficient in synthesizing both AND/OR and XOR-intensive functions. It also has a capability to handle very large circuits, as it employs the BDD decomposition in the partitioned Boolean network environment. The experimental results show that BDD-based logic decomposition is a promising alternative to the existing logic optimization approaches. In particular, it offers a superior runtime advantage over traditional logic synthesis systems.
منابع مشابه
A PSO-based Optimization of a fuzzy-based MPPT controller for a photovoltaic pumping system used for irrigation of greenhouses
The main asset of this paper is among the uses of fuzzy logic in the engineering sector and especially in the renewable energies as a large alternate of fossil energies, in this paper a PSO-based optimization is used to find the optimal scaling parameters, of a fuzzy logic-based MPPT controller, that maximize the efficiency of a photovoltaic pumping system. The tuning of input and output parame...
متن کاملPTM: A Technology Mapper for Pass-Transistor Logic
Pass-Transistor Mapper (PTM), a logic synthesis tool speci cally designed for passtransistor based logic library that has only three basic cells, is reported. It exploits the close relationship between BDD representation of logic and the structure of pass-transistor logic cells to ensure e cient technology mapping. BDD variable order optimization is achieved through a genetic algorithm with dyn...
متن کاملBDD Decomposition for Efficient Logic Synthesis
There are two major approaches to the synthesis of logic circuits. One is based on a predominantly algebraic factorization leading to AND/OR logic optimization. The other is based on classical Reed-Muller decompositionmethod and its related decision diagrams, which have been shown to be efficient for XOR-intensive arithmetic functions. Both approaches share the same characteristics: while one i...
متن کاملOptimizing a BDD-Based Modal Solver
In an earlier work we showed how a competitive satisfiability solver for the modal logicK can be built on top of a BDD package. In this work we study optimization issues for such solvers. We focus on two types of optimizations. First we study variable ordering, which is known to be of critical importance to BDD-based algorithms. Second, we study modal extensions of the pure-literal rule. Our re...
متن کامل